Infinite Server Queues with Synchronized Departures Driven by a Single Point Process

نویسنده

  • Michael A. Zazanis
چکیده

We analyze an infinite-server queueing model with synchronized arrivals and departures driven by the point process {Tn} according to the following rules. At time Tn, a single customer (or a batch of size βn) arrives to the system. The service requirement of the ith customer in the nth batch is σi,n. All customers enter service immediately upon arrival but each customer leaves the system at the first epoch of the point process {Tn} which occurs after his service requirement has been satisfied. For this system the queue length process and the statistics of the departing batches of customers are investigated under various assumptions for the statistics of the point process {Tn}, the incoming batch sequence {βn}, and the service sequence {σi,n}. Results for the asymptotic distribution of the departing batches when the service times are long compared to the interarrival times are also derived.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fluid Queues Driven by a Discouraged Arrivals Queue

We consider a fluid queue driven by a discouraged arrivals queue and obtain explicit expressions for the stationary distribution function of the buffer content in terms of confluent hypergeometric functions. We compare it with a fluid queue driven by an infinite server queue. Numerical results are presented to compare the behaviour of the buffer content distributions for both these models. 1. I...

متن کامل

Duality and Equivalencies in Closed Tandem Queueing Networks

Equivalence relations between closed tandem queueing networks are established. Four types of models are under consideration: single-server infinite-capacity buffer queues, infinite-server queues with resequencing, single-server unit-capacity buffer queues with blocking before service, and single-server unit-capacity buffer queues with blocking after service. Using a customer/server duality we s...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

Queues, stores, and tableaux

Consider the single server queue with an infinite buffer and a FIFO discipline, either of type M/M/1 or Geom/Geom/1. Denote by A the arrival process and by s the services. Assume the stability condition to be satisfied. Denote by D the departure process in equilibrium and by r the time spent by the customers at the very back of the queue. We prove that (D, r) has the same law as (A, s) which is...

متن کامل

Heavy-traffic limits for many-server queues with service interruptions

We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing customer abandonment (the +M), subject to exogenous regenerative service interruptions. With unscaled service interruption times, we obtain a FWLLN for the queue-length process where the limit is an ordinary differential equation in a two-state random environment. With asymptotically negligible service interru...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2004